An extension theorem for [n, k, d]d codes with gcd(d, q)=2

نویسندگان

  • Yuri Yoshida
  • Tatsuya Maruta
چکیده

As a continuation of Maruta [Finite Fields Appl. 10 (2004), 674–685], we investigate the extendability of [n, k, d]q codes with d ≡ −2 (mod q) whose weights are congruent to 0, −1 or −2 (mod q) for even q ≥ 4. We show that such codes are extendable for all even q ≥ 8, giving a new extension theorem for [n, k, d]q codes with gcd(d, q) = 2. We also consider the extendability of such codes for q = 4.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some generalizations of extension theorems for linear codes over finite fields

We give four new extension theorems for linear codes over Fq: (a) For q = 2, h ≥ 3, every [n, k, d]q code with d odd whose weights are congruent to 0 or d (mod q/2) is extendable. (b) For q = 2, h ≥ 3, every [n, k, d]q code with gcd(d, q) = 2 whose weights are congruent to 0 or d (mod q) is doubly extendable. (c) For integers h,m, t with 0 ≤ m < t ≤ h and prime p, every [n, k, d]q code with gcd...

متن کامل

Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3

Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...

متن کامل

On Silverman's conjecture for a family of elliptic curves

Let $E$ be an elliptic curve over $Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let $E^{(D)}(Bbb{Q})$ be the group of $Bbb{Q}$-rational points of $E^{(D)}$. It is conjectured by J. Silverman that there are infinitely many primes $p$ for which $...

متن کامل

Propagation Rules of Subsystem Codes

We demonstrate propagation rules of subsystem code constructions by extending, shortening and combining given subsystem codes. Given an [[n, k, r, d]]q subsystem code, we drive new subsystem codes with parameters [[n + 1, k, r,≥ d]]q, [[n − 1, k + 1, r,≥ d − 1]]q , [[n, k − 1, r + 1, d]]q . We present the short subsystem codes. The interested readers shall consult our companion papers for upper...

متن کامل

On the (2,1)-extendability of ternary linear codes

We show that every [n, k, d]3 code with diversity (Φ0, Φ1), 3 ≤ k ≤ 5, gcd(d, 3) = 1, is (2, 1)-extendable except for the case (Φ0, Φ1) = (40, 36) for k = 5, and that an [n, 5, d]3 code with diversity (40, 36), gcd(d, 3) = 1, is (2, 1)-extendable if Ad ≤ 50. Geometric conditions for the (2, 1)-extendability of not necessarily extendable [n, k, d]3 codes for k = 5, 6 are also given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2010